Critical Properties and Complexity Measures of Read-Once Boolean Functions
نویسندگان
چکیده
منابع مشابه
An improvement on the complexity of factoring read-once Boolean functions
Read-once functions have gained recent, renewed interest in thefields of theory and algorithmsofBoolean functions, computational learning theory and logic design and verification. In an earlier paper [M.C. Golumbic, A.Mintz, U. Rotics, Factoring and recognition of read-once functions using cographs and normality, and the readability of functions associated with partial k-trees, Discrete Appl. M...
متن کاملComplexity Measures of Cryptographically Secure Boolean Functions
In stream cipher cryptography a pseudorandom sequence of bits of length equal to the message length is generated. This sequence is then bitwise XORed (addition modulo 2) with the message sequence and the resulting sequence is transmitted. At the receiving end, deciphering is done by generating the same pseudorandom sequence and bitwise XORing the cipher bits with the random bits. The seed of th...
متن کاملIntroducing Read-Polarity-Once Functions
Efficient exact factoring algorithms exist in the literature, but they are limited to read-once (RO) functions where each variable appears once in the final equation. These algorithms have two limitations: (1) they do not consider incompletely specified functions; and (2) they are not applicable to binate functions. To overcome the first limitation, we propose an algorithm that finds RO formula...
متن کاملTesting Monotone Read-Once Functions
A checking test for a monotone read-once function f depending essentially on all its n variables is a set of vectors M distinguishing f from all other monotone read-once functions of the same variables. We describe an inductive procedure for obtaining individual lower and upper bounds on the minimal number of vectors T (f) in a checking test for any function f . The task of deriving the exact v...
متن کاملOn the parity complexity measures of Boolean functions
The parity decision tree model extends the decision tree model by allowing the computation of a parity function in one step. We prove that the deterministic parity decision tree complexity of any Boolean function is polynomially related to the non-deterministic complexity of the function or its complement. We also show that they are polynomially related to an analogue of the block sensitivity. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematics and Artificial Intelligence
سال: 2021
ISSN: 1012-2443,1573-7470
DOI: 10.1007/s10472-021-09734-6